31![Session #5: Learning With Errors Chris Peikert Georgia Institute of Technology Winter School on Lattice-Based Cryptography and Applications Session #5: Learning With Errors Chris Peikert Georgia Institute of Technology Winter School on Lattice-Based Cryptography and Applications](https://www.pdfsearch.io/img/4fd93f9e6f7c25874f28d2df1428f85f.jpg) | Add to Reading ListSource URL: web.eecs.umich.eduLanguage: English - Date: 2015-09-08 16:32:02
|
---|
32![Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices Jonathan Katz1? and Vinod Vaikuntanathan2 1 University of Maryland Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices Jonathan Katz1? and Vinod Vaikuntanathan2 1 University of Maryland](https://www.pdfsearch.io/img/5c6ec927c90397f80acab4c3f77269ed.jpg) | Add to Reading ListSource URL: www.cs.umd.eduLanguage: English - Date: 2009-09-07 10:57:44
|
---|
33![Practical Lattice-based Digital Signature Schemes Practical Lattice-based Digital Signature Schemes](https://www.pdfsearch.io/img/c6504c9fd05eb74f19367ee54fe78b70.jpg) | Add to Reading ListSource URL: csrc.nist.govLanguage: English - Date: 2015-04-09 11:42:22
|
---|
34![Cryptography from Post-Quantum Assumptions Raza Ali Kazmi Doctor of Philosophy Cryptography from Post-Quantum Assumptions Raza Ali Kazmi Doctor of Philosophy](https://www.pdfsearch.io/img/9548272fffc4a8918c244f19c04c50d0.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2015-04-18 18:23:29
|
---|
35![](https://www.pdfsearch.io/img/58626cdd15272c661dfd4d804df03286.jpg) | Add to Reading ListSource URL: csrc.nist.govLanguage: English - Date: 2015-04-02 10:56:48
|
---|
36![Lattice-based Cryptography Daniele Micciancio∗ Oded Regev† July 22, 2008 Lattice-based Cryptography Daniele Micciancio∗ Oded Regev† July 22, 2008](https://www.pdfsearch.io/img/cc45543187ce72603215d2759e38e589.jpg) | Add to Reading ListSource URL: www.cims.nyu.eduLanguage: English - Date: 2008-07-22 12:40:02
|
---|
37![A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol (Extended version of WEWORC paper, presented in July 2007, in Bochum, Germany) Carlos Aguilar-Melchor and Philippe Gaborit XLIM - Universit A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol (Extended version of WEWORC paper, presented in July 2007, in Bochum, Germany) Carlos Aguilar-Melchor and Philippe Gaborit XLIM - Universit](https://www.pdfsearch.io/img/b7e77a76cd266d273a217112f67e9586.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2008-02-24 13:37:04
|
---|
38![The Learning with Errors Problem Oded Regev∗ Abstract In this survey we describe the Learning with Errors (LWE) problem, discuss its properties, its hardness, and its cryptographic applications. The Learning with Errors Problem Oded Regev∗ Abstract In this survey we describe the Learning with Errors (LWE) problem, discuss its properties, its hardness, and its cryptographic applications.](https://www.pdfsearch.io/img/c08fede1854dc9a941ce9f595817620d.jpg) | Add to Reading ListSource URL: www.cims.nyu.eduLanguage: English - Date: 2010-06-01 03:43:39
|
---|
39![Representing Hard Lattices with O(n log n) Bits ∗ Mikl´ os Ajtai Representing Hard Lattices with O(n log n) Bits ∗ Mikl´ os Ajtai](https://www.pdfsearch.io/img/98294069c40a9c14e67c3ca21159e59b.jpg) | Add to Reading ListSource URL: cjtcs.cs.uchicago.eduLanguage: English - Date: 2008-05-13 00:45:28
|
---|
40![The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based crypt The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based crypt](https://www.pdfsearch.io/img/4a3501261a9efd4301e406775c292fc7.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2008-12-01 09:32:36
|
---|